Lifts, derandomization, and diameters of Schreier graphs of Mealy automata
نویسندگان
چکیده
It is known that random 2-lifts of graphs give rise to expander graphs. We present a new conjectured derandomization of this construction based on certain Mealy automata. We verify that these graphs have polylogarithmic diameter, and present a class of automata for which the same is true. However, we also show that some automata in this class do not give rise to expander graphs.
منابع مشابه
Automaton (semi)groups: Wang tilings and Schreier tries
Groups and semigroups generated by Mealy automata were formally introduced in the early sixties. They revealed their full potential over the years, by contributing to important conjectures in group theory. In the current chapter, we intend to provide various combinatorial and dynamical tools to tackle some decision problems all related to some extent to the growth of automaton (semi)groups. In ...
متن کاملFinite automata for Schreier graphs of virtually free groups
The Stallings construction for f.g. subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an efficient computation of the core of a Schreier graph based on edge folding. It is proved that those groups admitting Stallings sections are precisely f.g. virtually free groups, through a constructive approach based on Basse-Serre theory. Complexity issue...
متن کاملThe finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-letter invertible-reversible Mealy automata.
متن کاملOn Composite and Non-monotonic Growth Functions of Mealy Automata
Abstract. We introduce the notion of composite growth function and provide examples that illustrate the primary properties of these growth functions. There are provided examples of Mealy automata that have composite nonmonotonic growth functions of the polynomial growth order. There are described examples of Mealy automata that have composite monotonic growth functions of intermediate and expon...
متن کاملGroups and Semigroups Defined by some Classes of Mealy Automata
Two classes of finite Mealy automata (automata without branches, slowmoving automata) are considered in this article. We study algebraic properties of transformations defined by automata of these classes. We consider groups and semigroups defined by automata without branches.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 37 شماره
صفحات -
تاریخ انتشار 2017